A Population and Interval Constraint Propagation Algorithm
نویسندگان
چکیده
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. Unlike other evolutionary algorithm which gives only heuristic solutions, PICPA is able to bound effectively the Pareto optimal front as well as to produce accurate approximate solutions.
منابع مشابه
A Population and Interval Constraint Propagation Algorithm for Multi-objective Optimization
In this paper, we present PICPA, the “Population and Interval Constraint Propagation Algorithm” which is able to produce high quality approximate solutions while giving guaranteed bounds for the Pareto optimal front. These bounds allow us to know whether the heuristic solutions are close to or far away from the optimal front. PICPA combines “Interval Constraint Propagation” (ICP) techniques [1,...
متن کاملInterval Propagation on Directed Acyclic Graphs Interval Propagation and Search on Directed Acyclic Graphs for Numerical Constraint Solving
The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed by Schichl and Neumaier [2005]. For representing numerical problems, the authors use DAGs whose nodes are subexpressions and whose directed edges are computational flows. Compared to tree-based representations [Benhamou et al. 1999], DAGs offer t...
متن کاملInterval propagation and search on directed acyclic graphs for numerical constraint solving
The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed by Schichl and Neumaier [2005]. For representing numerical problems, the authors use DAGs whose nodes are subexpressions and whose directed edges are computational flows. Compared to tree-based representations [Benhamou et al. 1999], DAGs offer t...
متن کاملComparison of Interval Constraint Propagation Algorithms for Vehicle Localization
Interval constraint propagation (ICP) algorithms allow to solve problems described as constraint satisfaction problems (CSP). ICP has been successfully applied to vehicle localization in the last few years. Once the localization problem has been stated, a large class of ICP solvers can be used. This paper compares a few ICP algorithms, using the same experimental data, in order to rank their pe...
متن کاملExploiting Monotonicity in Interval Constraint Propagation
We propose in this paper a new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), that exploits monotonicity of functions. The propagation is standard, but the Mohc-Revise procedure, used to filter/contract the variable domains w.r.t. an individual constraint, uses monotonic versions of the classical HC4-Revise and BoxNarrow procedures. Mohc-Revise appears to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003